Hide and Seek: Outwitting Community Detection Algorithms
نویسندگان
چکیده
Community affiliation of a node plays an important role in determining its contextual position the network, which may raise privacy concerns when sensitive wants to hide identity network. Oftentimes, target community seeks protect itself from adversaries so that constituent members remain hidden inside The current study focuses on hiding such communities targeted nodes can be concealed. This leads problem deception, investigates avenues minimally rewiring network given maximally hides detection algorithm (CDA). We formalize deception and introduce Network using permanence loss (NEURAL), novel method greedily optimizes node-centric objective function determine strategy. Theoretical settings pose restriction number strategies employed optimize function, turn reduces overhead choosing best strategy multiple options. also show our is submodular monotone. When tested both synthetic seven real-world networks, NEURAL able deceive six widely used CDAs. benchmark performance with respect four state-of-the-art methods evaluation metrics. In addition, qualitative analysis three other attributed networks reveals NEURAL, quite strikingly, captures metainformation about edges otherwise could not inferred by observing only their topological structures.
منابع مشابه
Hide and seek in Arizona
Laboratory subjects repeatedly played one of two variations of a simple two-person zero-sum game of ‘‘hide and seek’’. Three puzzling departures from the prescriptions of equilibrium theory are found in the data: an asymmetry related to the player’s role in the game; an asymmetry across the game variations; and positive serial correlation in subjects’ play. Possible explanations for these depar...
متن کاملHide and Seek with Supersymmetry
This is the summary of a 90 minute introductory talk on Supersymmetry presented at the August 1998 Zuoz Summer School on “Hidden Symmetries and Higgs Phenomena”. I first review the hierarchy problem, and then discuss why we expect supersymmetry just around the corner, i.e. at or below 1TeV . I focus on the specific example of the anomalous magnetic moment of the muon to show how supersymmetry c...
متن کاملR - parity violation : Hide & Seek
We point out that, if R-parity is broken spontaneously, the neutralino can decay to the final state majoron plus neutrino, which from the experimental point of view is indistinguishable from the standard missing momentum signal of supersymmetry. We identify the regions of parameter space where this decay mode is dominant and show that they are independent of R-parity conserving SUSY parameters....
متن کاملHide and Seek in a Complex World
Complex networks have become the key to uncover the patterns of interactions in man-made and complex systems in nature. The Internet, the proteins in our cells, our bonds of friendship and the web-pages we daily browse form networks. Despite their widely different origins the networks have many interesting features in common. We endeavor to a better understanding of both man-made structures, li...
متن کاملHide and Seek - a Naive Factoring
I present a factoring algorithm that factors N = U V , where U < V , provably in O(N 1/3+ǫ) time. I also discuss the potential for improving this to a sub-exponential algorithm. Along the way, I consider the distribution of solutions (x, y) to xy = N mod a. 1. Algorithm-hide and seek Let N be a positive integer that we wish to factor. Say N = U V where U and V are positive integers, not necessa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computational Social Systems
سال: 2021
ISSN: ['2373-7476', '2329-924X']
DOI: https://doi.org/10.1109/tcss.2021.3062711